A Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks

نویسندگان

  • Yih-jia Tsai
  • Philip K. McKinley
چکیده

A new approach to broadcast in wormhole-routed two-and three-dimensional torus networks is proposed. The approach extends the concept of dominating sets from graph theory by accounting for the relative distance-insensitivity of the wormhole routing switching strategy and by taking advantage of an all-port communication architecture. The resulting broadcast operation is based on a tree structure that uses multiple levels of extended dominating nodes (EDN). Performance results are presented that connrm the advantage of this method over recursive doubling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Recursion-Based Broadcast Paradigm in Wormhole Routed Mesh/Torus Networks

A novel broadcast technique for wormhole-routed mesh and torus parallel computers based on recursion is presented in this paper. It works by partitioning the graph into several subgraphs similar to the original one, and identifying a characteristic low-dimensional subgraph from these subgraphs. The source message is first scattered in the characteristic low-dimensional subgraph of the original ...

متن کامل

Near-Optimal Broadcast in All-Port Wormhole-Routed 3D Tori with Dimension-Ordered Routing

The one-to-all broadcast is the most primary operation in a multicomputer network. In this paper, we study this problem in a wormhole-routed 3D torus which provides the dimension-ordered routing and the all-port communication capability. We propose an efficient scheme to utilize the distance-insensitive characteristic of wormhole routing. The scheme requires at most 4 steps more than the optima...

متن کامل

Multi-node Broadcasting in All-Ported 3-D Wormhole-Routed Torus Using Aggregation-then-Distribution Strategy

In this paper, we investigate the multi-node broadcasting problem in a 3-D torus, where there are an unknown number of s source nodes located at unknown positions each intending to broadcast a message of size m bytes to the rest of the network. The torus is assumed to use the all-port model and the popular dimension-ordered routing. Existing congestion-free results are derived based on finding ...

متن کامل

Multi-Node Broadcasting in a Wormhole-Routed 2-D Torus Using an Aggregation-then-Distribution Strategy

This paper presents an efficient multi-node broadcasting algorithm in a wormhole-routed 2-D torus, where there are an unknown number of s source nodes located on unknown positions each intending to broadcast a message of size m bytes to the rest of network. The torus is assumed to use the all-port model and the popular dimension-ordered routing. Most existing results are derived based on findin...

متن کامل

Algebraic Foundations and Broadcasting Algorithms for Wormhole-Routed All-Port Tori

The one-to-all broadcast is the most primary collective communication pattern in a multicomputer network. We consider this problem in a wormhole-routed torus which uses all-port and dimension-ordered routing model. We derive our routing algorithms based on the concept of "span of vector spaces" in linear algebra. For instance, in a 3-D torus, the nodes receiving the broadcast message will be "s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Parallel Distrib. Syst.

دوره 7  شماره 

صفحات  -

تاریخ انتشار 1996